Random Walks on Quasirandom Graphs
نویسندگان
چکیده
Let G be a quasirandom graph on n vertices, and let W be a random walk on G of length αn. Must the set of edges traversed by W form a quasirandom graph? This question was asked by Böttcher, Hladký, Piguet and Taraz. Our aim in this paper is to give a positive answer to this question. We also prove a similar result for random embeddings of trees.
منابع مشابه
Parallel Quasirandom Walks on the Boundary
s — The Monte Carlo method called “random walks on boundary” has been successfully used for solving boundary-value problems. This method has significant advantages when compared with random walks on spheres, balls or on discrete grids when an exterior Dirichlet or Neumann problem is solved, or when we are interested in computing the solution to a problem at an arbitrary number of points using a...
متن کاملSolving BVPs Using Quasirandom Walks on the Boundary
The “random walk on the boundary” Monte Carlo method has been successfully used for solving boundary-value problems. This method has significant advantages when compared to random walks on spheres, balls or a grid, when solving exterior problems, or when solving a problem at an arbitrary number of points using a single random walk. In this paper we study the properties of the method when we use...
متن کاملQuasirandom geometric networks from low-discrepancy sequences.
We define quasirandom geometric networks using low-discrepancy sequences, such as Halton, Sobol, and Niederreiter. The networks are built in d dimensions by considering the d-tuples of digits generated by these sequences as the coordinates of the vertices of the networks in a d-dimensional I^{d} unit hypercube. Then, two vertices are connected by an edge if they are at a distance smaller than a...
متن کاملQuasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally well on many graphs and better for sparse random graphs. In this work we show three main results for the quasirandom rumor spreading model. We exhibit a natural expansion property for networks which suffices to make quasirandom r...
متن کاملFrom quasirandom graphs to graph limits and graphlets
We generalize the notion of quasirandom which concerns a class of equivalent properties that random graphs satisfy. We show that the convergence of a graph sequence under the spectral distance is equivalent to the convergence using the (normalized) cut distance. The resulting graph limit is called graphlets. We then consider several families of graphlets and, in particular, we characterize quas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 20 شماره
صفحات -
تاریخ انتشار 2013